A simple and efficient Union–Find–Delete algorithm
نویسندگان
چکیده
منابع مشابه
A Simple and Efficient Template Matching Algorithm
We propose a general framework for object tracking in video images. It consists in low-order parametric models for the image motion of a target region. These models are used to predict the movement and to track the target. The difference of intensity between the pixels belonging to the current region and the pixels of the selected target (learnt during an off-line stage) allows a straightforwar...
متن کاملA Simple, Artistic and Efficient Modification of the Inversion Method
The simplest and fastest way of producing an acceptable and accurate cast is by adopting the two-pour or inversion method. This process is slightly cumbersome and messy due to difficulty of access. A much more efficient, easy and artistic way of accomplishing it is described by adopting a Rotating Cake Icing Table with a Silicone Baking Mat on top as an autoclavable non-stick barrier.
متن کاملa new algorithm and software of individual life insurance and annuity computation
چکیده ندارد.
15 صفحه اولA Simple and Efficient Algorithm for Hypercycle Detection
We present an algorithm for hypercyle detection in a Backward Directed Hypergraphs(BDH), where is the size of the hypergraph. BDHs provide a representation model for many-one relationships and have found applications in several areas within Computer Science and Operations Research. Our interest in BDHs arise from there application within data mining where they can be used to represent a certain...
متن کاملA simple and efficient Union-Find-Delete algorithm
The Union-Find data structure for maintaning disjoint sets is one of the best known and widespread data structures, in particular the version with constant-time Union and efficient Find. Recently, the question of how to handle deletions from the structure in an efficient manner has been taken up, first by Kaplan, Shafrir and Tarjan (2002) and subsequently by Alstrup et al. (2005). The latter wo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.11.005